Circuit complexity

Results: 364



#Item
341Computational learning theory / Boolean algebra / Circuit complexity / NC / Probably approximately correct learning / Binary decision diagram / Algorithm / Computational complexity theory / Theoretical computer science / Applied mathematics / Mathematics

On Learning Width Two Branching Programs –Extended Abstract–

Add to Reading List

Source URL: www.cs.technion.ac.il

Language: English - Date: 2004-04-01 09:16:00
342Ramphotyphlops braminus / Herpetology / Peptides / Fauna of Asia / Circuit complexity / NC

caribbean herpetology article

Add to Reading List

Source URL: www.caribbeanherpetology.org

Language: English - Date: 2014-01-17 14:14:02
343Circuit complexity / FO / ACC0 / AC0 / DLOGTIME / BIT predicate / Computational complexity theory / AC / TC0 / Theoretical computer science / Applied mathematics / Complexity classes

Uniform Constant-Depth Threshold Circuits for Division and Iterated Multiplication William Hesse1

Add to Reading List

Source URL: ftp.cs.rutgers.edu

Language: English - Date: 2002-06-10 12:16:49
344Complexity classes / Circuit complexity / ACC0 / NC / PP / Circuit / FO / Boolean circuit / P / Theoretical computer science / Computational complexity theory / Applied mathematics

JOURNAL OF COMPUTER

Add to Reading List

Source URL: www.igi.tugraz.at

Language: English - Date: 2013-12-10 07:35:33
345Complexity classes / Computational resources / Pseudorandomness / Analysis of algorithms / Advice / Bounded-error probabilistic polynomial / NTIME / Pseudorandom generator / Circuit complexity / Theoretical computer science / Computational complexity theory / Applied mathematics

In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time Russell Impagliazzo∗

Add to Reading List

Source URL: www.math.ias.edu

Language: English - Date: 2003-11-18 15:48:52
346Complexity classes / NP-complete / Boolean algebra / NP / PP / UP / P / Reduction / Arithmetic circuit complexity / Theoretical computer science / Computational complexity theory / Applied mathematics

Light Up is NP-complete Brandon McPhail February 28, 2005

Add to Reading List

Source URL: people.cs.umass.edu

Language: English - Date: 2007-09-02 12:14:45
347Johan Håstad / Gödel Prize / Circuit complexity / Silvio Micali / ACM SIGACT / International Colloquium on Automata /  Languages and Programming / Theoretical computer science / Applied mathematics / Computer science

Johan Håstad February 2013

Add to Reading List

Source URL: www.nada.kth.se

Language: English - Date: 2013-02-27 07:36:02
348Integrated circuits / Electronic design / Logic families / CMOS / Winner-take-all / Electronic circuit / Electronic engineering / Electronics / Electromagnetism

WINNER-TAKE-ALL NETWORKS OF O(N ) COMPLEXITY BY

Add to Reading List

Source URL: www.cs.berkeley.edu

Language: English - Date: 2007-01-02 20:32:45
349Complexity classes / Circuit complexity / Nitin Saxena / Neeraj Kayal / Manindra Agrawal / AKS primality test / Primality test / ACC0 / Indian Institute of Technology Kanpur / Theoretical computer science / Applied mathematics / Mathematics

Nitin Saxena Contact Information

Add to Reading List

Source URL: www.math.uni-bonn.de

Language: English - Date: 2012-10-24 07:17:58
350Models of computation / Computability theory / Digital electronics / Computational complexity theory / Computability / Logic gate / Computer / Finite-state machine / Electronic circuit / Theoretical computer science / Mathematics / Applied mathematics

The science of computing first edition

Add to Reading List

Source URL: ozark.hendrix.edu

Language: English - Date: 2003-12-19 15:54:33
UPDATE